Some nonsimple modules for centralizer algebras of the symmetric group
نویسندگان
چکیده
منابع مشابه
Centralizer algebras of the group associated to ℤ4-codes
The purpose of this paper is to investigate the finite group which appears in the study of the Type II Z4-codes. To be precise, it is characterized in terms of generators and relations, and we determine the structure of the centralizer algebras of the tensor representations of this group.
متن کاملMatrix Units for Centralizer Algebras
We compute matrix units for Brauer’s centralizer algebras and Hecke algebras of type A. This can be used to construct a complete system of matrix units of the centralizers of tensor products of classical Lie groups (except S0(2n)) and their quantum deformations. The calculation is done by induction inspired by path models for special operator algebras. It is similar to the calculation of Young’...
متن کاملThe Structure of Some Permutation Modules for the Symmetric Group of Innnite Degree
Suppose that is an innnite set and k is a natural number. Let ] k denote the set of all k-subsets of and let F be a eld. In this paper we study the FSym(()-submodule structure of the permutation module F] k. Using the representation theory of nite symmetric groups, we show that every submodule of F] k can be written as an intersection of kernels of certain FSym(()-homomorphisms F] k ?! F] l for...
متن کاملCharacters of Brauer's Centralizer Algebras
Brauer's centralizer algebras are finite dimensional algebras with a distinguished basis. Each Brauer centralizer algebra contains the group algebra of a symmetric group as a subalgebra and the distinguished basis of the Brauer algebra contains the permutations as a subset. In view of this containment it is desirable to generalize as many known facts concerning the group algebra of the symmetri...
متن کاملComputing the Discriminants of Brauer's Centralizer Algebras
This paper discusses a computational problem arising in the study of the structure theory of Brauer's orthogonal and symplectic centralizer algebras. The problem is to compute the ranks of certain combinatorially defined matrices Zm k(x) (these matrices are presented in §2). This computation is difficult because the sizes of the matrices Zm k(x) are enormous even for small values of m and k . H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2016
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2016.9.877